The RSA Cryptosystem
نویسندگان
چکیده
This paper explores the history and mathematics be hind the RSA cryptosystem, including the idea of public key cryp tosystems and number theory. It outlines the applications of RSA including secure information transfers and electronic signatures. It also analyzes why RSA is a secure way of transmitting information and the ways that it has been defeated in the past. In particular, we focus on the method of the quadratic sieve, a version of which was used to crack RSA-129.
منابع مشابه
QTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملAn Efficient RSA Cryptosystem with BM-PRIME Method
Received Oct 5 th , 2012 Accepted Oct 30 th , 2012 Using more than two factors in the modulus of the RSA cryptosystem has the arithmetic advantage that the private key computation can be speeded up by CRT. With this idea, we present an efficient combination of two variants of RSA cryptosystem (Batch and Mprime RSA) which makes the decryption process faster than the existing variants. It can not...
متن کاملAttack on RSA Cryptosystem
The RSA cryptosystem is most widely used cryptosystem it may be used to provide both secrecy and digital signatures and its security is based on the intractability of the integer factorization. The security of RSA algorithm depends on the ability of the hacker to factorize numbers. New, faster and better methods for factoring numbers are constantly being devised. The Trent best for long numbers...
متن کاملApproaches in RSA Cryptosystem using Artificial Neural Network
RSA cryptosystem, the first public key cryptography presented in 1977. Neural networks are often used as a powerful discriminating estimator for tasks in function approximation. This paper describes a neural-network-based method relies on Radial Basis Function and Levenberg-Marquardt Backpropagation for estimating the behavior of the function used in RSA cryptosystem to calculate the function. ...
متن کاملA Matrix Extension of the RSA Cryptosystem
We propose a variation on the RSA Cryptosystem: namely, an extension of the RSA encryption and decryption methods to matrix values in addition to scalars. We first explore the mathematics behind the RSA Cryptosystem, after which, we investigate the theory of the proposed variation to the system. The concept of extending the RSA Cryptosystem to apply to matrices originated in a paper released by...
متن کاملOn the Efficiency of Fast RSA Variants in Modern Mobile Phones
Modern mobile phones are increasingly being used for more services that require modern security mechanisms such as the public-key cryptosystem RSA. It is, however, well-known that public-key cryptography demands considerable computing resources and that RSA encryption is much faster than RSA decryption. It is consequently an interesting question if RSA as a whole can be executed efficiently on ...
متن کامل